منابع مشابه
Completeness of algebraic CPS simulations
The algebraic lambda calculus (λalg) and the linear algebraic lambda calculus (λlin) are two extensions of the classical lambda calculus with linear combinations of terms. They arise independently in distinct contexts: the former is a fragment of the differential lambda calculus, the latter is a candidate lambda calculus for quantum computation. They differ in the handling of application argume...
متن کاملAlgebraic Totality, towards Completeness
Finiteness spaces constitute a categorical model of Linear Logic whose objects can be seen as linearly topologised spaces, (a class of topological vector spaces introduced by Lefschetz in 1942) and morphisms as continuous linear maps. First, we recall definitions of finiteness spaces and describe their basic properties deduced from the general theory of linearly topologised spaces. Then we give...
متن کاملAlgebraic simulations
A fruitful approach to the study of state-based systems consists in their mathematical formalization by means of models like Kripke structures, which allows to study their associated properties by means of simulations to relate them to other, possibly better-known systems [5, 7, 23]. This work tries to advance two main goals along those lines: the first, to generalize the notion of simulation b...
متن کاملCompleteness for Algebraic Theories of Local State
Every algebraic theory gives rise to a monad, and monads allow a meta-language which is a basic programming language with sideeffects. Equations in the algebraic theory give rise to equations between programs in the meta-language. An interesting question is this: to what extent can we put equational reasoning for programs into the algebraic theory for the monad? In this paper I focus on local s...
متن کاملComplexity Classes and Completeness in Algebraic Geometry
We study the computational complexity of sequences of projective varieties. We define analogues of the complexity classes P and NP for these and prove the NP-completeness of a sequence called the universal circuit resultant. This is the first family of compact spaces shown to be NP-complete in a geometric setting. Valiant's theory of algebraic/arithmetic complexity classes is an algebraic analo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2012
ISSN: 2075-2180
DOI: 10.4204/eptcs.88.2